Conformational Coverage by a Genetic Algorithm
نویسندگان
چکیده
A new approach for coverage of the conformational space by a limited number of conformers is proposed. Instead of using a systematic search whose time complexity increases exponentially with degrees of freedom, a genetic algorithm (GA) is employed to minimize 3D similarity among the conformers generated. This makes the problem computationally feasible even for large, flexible molecules. The 3D similarity of a pair of conformers is assumed to be reciprocal to the root-mean-square (rms) distance between identical atomic sites in an alignment providing its minimum. Thus, in contrast to traditional GA, the fitness of a conformer is not quantified individually but only in conjunction with the population it belongs to. The approach handles the following stereochemical and conformational degrees of freedom: rotation around acyclic single and double bonds, inversion of stereocenters, flip of free corners in saturated rings, and reflection of pyramids on the junction of two or three saturated rings. The latter two were particularly introduced to encompass the structural diversity of polycyclic structures. However, they generally affect valence angles and can be restricted up to a certain level of severity of such changes. Stereochemical modifications are totally/selectively disabled when the stereochemistry is exactly/partially specified on input. Three quality criteria, namely robustness, reproducibility, and coverage of the conformational space, are used to assess the performance of various GA experimental settings employed on four molecules with different numbers of conformational degrees of freedom. It was found that with the increase of the ratio between the number of parents and children, the reproducibility of GA runs increases whereas their robustness and coverage decrease. Force field optimization of conformers for each generation was found to improve significantly the reproducibility of results, at the cost of worse conformational coverage.
منابع مشابه
4D-QSAR analysis and pharmacophore modeling: propoxy methylphenyl oxasiazole derivatives by electron conformatitional-genetic algorithm method
In this 4D-QSAR study, we obtained pharmacophore identification and biological activity prediction for 50 propoxy methylphenyl oxadiazole derivatives by the Electron Conformational Genetic Algorithm approach. In light of the results given in the data obtained from quantum chemical calculations at HF/3-21 G level, the electron conformational matrices of congruity (ECMC) were built by EMRE softwa...
متن کاملCoverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...
متن کاملA Multi Objective Genetic Algorithm (MOGA) for Optimizing Thermal and Electrical Distribution in Tumor Ablation by Irreversible Electroporation
Background: Irreversible electroporation (IRE) is a novel tumor ablation technique. IRE is associated with high electrical fields and is often reported in conjunction with thermal damage caused by Joule heating. For good response to surgery it is crucial to produce minimum thermal damage in both tumoral and healthy tissues named Non-Thermal Irreversible Electroporation(NTIRE). Non-thermal irrev...
متن کاملمدلبندی و حل مساله ماکزیمم پوشش p -هاب تک تخصیصی با پوشش تدریجی
P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Chemical Information and Computer Sciences
دوره 39 شماره
صفحات -
تاریخ انتشار 1999